Application-driven bandwidth guarantees in datacenters

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enabling Work-conserving Bandwidth Guarantees for Multi-tenant Datacenters via Dynamic Tenant- eue Binding

Today’s cloud networks are shared among many tenants. Bandwidth guarantees and work conservation are two key properties to ensure predictable performance for tenant applications and high network utilization for providers. Despite significant efforts, very little prior work can really achieve both properties simultaneously even some of them claimed so. In this paper, we present QShare, an in-net...

متن کامل

Enabling Work-Conserving Bandwidth Guarantees for Multi-Tenant Datacenters via Dynamic Tenant-Queue Binding

Today’s cloud networks are shared among many tenants. Bandwidth guarantees and work conservation are two key properties to ensure predictable performance for tenant applications and high network utilization for providers. Despite significant efforts, very little prior work can really achieve both properties simultaneously even some of them claimed so. In this paper, we present QShare, a compreh...

متن کامل

Availability-aware Virtual Cluster Allocation in Bandwidth-Constrained Datacenters

As greater numbers of data-intensive applications are required to process big data in bandwidth-constrained datacenters with heterogeneous physical machines (PMs) and virtual machines (VMs), network core traffic is experiencing rapid growth. The VMs of a virtual cluster (VC) must be allocated as compactly as possible to avoid bandwidth-related bottlenecks. Since each PM/switch has a certain fai...

متن کامل

Queueing delay guarantees in bandwidth packing

This paper proposes a new formulation for the bandwidth packing problem, assuring maximum service delay in telecommunications networks. The bandwidth packing problem is one of selecting calls, from a list of requests, to be routed in the network. We limit the maximum queueing delay, while maximizing revenues generated from the routed calls. An efficient Lagrangean relaxation based heuristic pro...

متن کامل

Supporting Bandwidth Guarantees in Buffer-Limited Networks†

Flows traversing a buffer-limited network can suffer rapid throughput deterioration with increasing path length. This paper introduces a distributed transmission scheduling scheme that supports strong bandwidth guarantees for flows routed over a large number of hops, without compromising network utilization. The scheme is defined within a reservation-based transmission control framework. Throug...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGCOMM Computer Communication Review

سال: 2015

ISSN: 0146-4833

DOI: 10.1145/2740070.2626326